منابع مشابه
Adaptive search over sorted sets
We revisit the classical algorithms for searching over sorted sets to introduce an algorithm refinement, called Adaptive Search, that combines the good features of Interpolation search and those of Binary search. W.r.t. Interpolation search, only a constant number of extra comparisons is introduced. Yet, under diverse input data distributions our algorithm shows costs comparable to that of Inte...
متن کاملFlexible Interpolated-Binary Search over Sorted Sets
We revisit the classical algorithms for searching over sorted sets and introduce an algorithm refinement, called adaptive search, that combines the good features of Interpolation search and those of Binary search. W.r.t. Insertion sort, only a constant number of extra comparisons is introduced. Yet, under several relevant input data distributions our algorithm shows average case cost comparable...
متن کاملMany-sorted Sets
The article deals with parameterized families of sets. When treated in a similar way as sets (due to systematic overloading notation used for sets) they are called many sorted sets. For instance, if x and X are two many-sorted sets (with the same set of indices I) then relation x ∈ X is defined as ∀i∈Ixi ∈ Xi. I was prompted by a remark in a paper by Tarlecki and Wirsing: “Throughout the paper ...
متن کاملOn transitive soft sets over semihypergroups
The aim of this paper is to initiate and investigate new soft sets over semihypergroups, named special soft sets and transitive soft sets and denoted by $S_{H}$ and $T_{H},$ respectively. It is shown that $T_{H}=S_{H}$ if and only if $beta=beta^{*}.$ We also introduce the derived semihypergroup from a special soft set and study some properties of this class of semihypergroups.
متن کاملAdaptive search area for fast motion estimation
In this paper a new method for determining the search area for motion estimation algorithm based on block matching is suggested. In the proposed method the search area is adaptively found for each block of a frame. This search area is similar to that of the full search (FS) algorithm but smaller for most blocks of a frame. Therefore, the proposed algorithm is analogous to FS in terms of reg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2015
ISSN: 1570-8667
DOI: 10.1016/j.jda.2014.12.007